Non-Turing Computers and Non-Turing Computability*

نویسنده

  • Mark Hogarth
چکیده

Various examples of Malament-Hogarth (hereafter, M-H) spacetimes are given in Hogarth (1992), but the following artificial example from Earman and Norton (1993) is perhaps the simplest. Start with Minkowski spacetime (R4, η) and choose a scalar field Ω on M such that Ω=1 outside a compact set C⊂M and Ω tends rapidly to infinity as a point r∈C is approached. The spacetime (R4-r, Ω2η), depicted in Figure 1, is then M-H. (Although the region inside C appears quite small, it is in fact as large as the complement of C.)

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some improvements in fuzzy turing machines

In this paper, we improve some previous definitions of fuzzy-type Turing machines to obtain degrees of accepting and rejecting in a computational manner. We apply a BFS-based search method and some level’s upper bounds to propose a computational process in calculating degrees of accepting and rejecting. Next, we introduce the class of Extended Fuzzy Turing Machines equipped with indeterminacy s...

متن کامل

Parallel Feedback Turing Computability

In contrast to most kinds of computability studied in mathematical logic, feedback computability has a non-degenerate notion of parallelism. Here we study parallelism for the most basic kind of feedback, namely that of Turing computability. We investigate several different possible definitions of parallelism in this context, with an eye toward specifying what is so computable. For the determini...

متن کامل

Degrees of unsolvability of continuous functions

We show that the Turing degrees are not sufficient to measure the complexity of continuous functions on [0, 1]. Computability of continuous real functions is a standard notion from computable analysis. However, no satisfactory theory of degrees of continuous functions exists. We introduce the continuous degrees and prove that they are a proper extension of the Turing degrees and a proper substr...

متن کامل

Can new physics challenge “old” computational barriers?

We discuss the impact of very recent developments of spacetime theory, black hole physics, and cosmology to well established foundational issues of computability theory and logic. Namely, we describe a physical device in relativistic spacetime which can compute a non-Turing computable task, e.g. which can decide the halting problem of Turing machines or whether ZF set theory is consistent or no...

متن کامل

The Turing Machine Paradigm in Contemporary Computing

The importance of algorithms is now recognized in all mathematical sciences, thanks to the development of computability and computational complexity theory in the 20th century. The basic understanding of computability theory developed in the nineteen thirties with the pioneering work of mathematicians like Gödel, Church, Turing and Post. Their work provided the mathematical basis for the study ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994